Current Issue : April - June Volume : 2019 Issue Number : 2 Articles : 5 Articles
The aim of this work was the behavior analysis when a spell checker was integrated\nas an extra pre-process during the first stage of the test mining. Different\nmodels were analyzed, choosing the most complete one considering\nthe pre-processes as the initial part of the text mining process. Algorithms for\nthe Spanish language were developed and adapted, as well as for the methodology\ntesting through the analysis of 2363 words. A capable notation for\nremoving special and unwanted characters was created. Execution times of\neach algorithm were analyzed to test the efficiency of the text mining\npre-process with and without orthographic revision. The total time was\nshorter with the spellchecker than without it. The key difference of this work\namong the existing related studies is the first time that the spell checker is\nused in the text mining preprocesses....
Learning the Bayesian networks (BNs) structure from data has received increasing attention.\nMany heuristic algorithms have been introduced to search for the optimal network that best matches\nthe given training data set. To further improve the performance of ant colony optimization (ACO) in\nlearning the BNs structure, this paper proposes a new improved coevolution ACO (coACO) algorithm,\nwhich uses the pheromone information as the cooperative factor and the differential evolution (DE) as\nthe cooperative strategy. Different from the basic ACO, the coACO divides the entire ant colony into\nvarious sub-colonies (groups), among which DE operators are adopted to implement the cooperative\nevolutionary process. Experimental results demonstrate that the proposed coACO outperforms the\nbasic ACO in learning the BN structure in terms of convergence and accuracy....
FIR filter is an important type of filter in the field of signal processing because\nof its inherent stability, simpler structure, and easier implementation on linear\nphase. WCA is used to solve FIR filter design with low magnitude error\nand linear phase in passband. This method uses WCA to optimize the filter\ncoefficient based on the low magnitude errors in all frequency domains.\nMoreover, in the constraint conditions, the least group delay in passband is\nused for the optimization. The experiments testify this method has good performance\non the passband error and group delay error in the passband.\nTherefore this method is an efficient algorithm for FIR filter optimization\nwhich can be used in the digital signal processing widely....
Edge detection considered as very important and fundamental tool in image\nprocessing. An image edge is a very sensitive place where the image information\nand details mostly placed on it. Different filters were used to detect and\nenhance these edges to improve the sharpness and raising the image clarity.\nThe significance of this paper comes from the study, compare and evaluate\nthe effects of three well-known edge detection techniques in a spatial domain,\nwhere this evaluation was performed using both subjective and objective\nmanner to find out the best edge detection algorithm. The Sobel, Homogeneity\nand Prewitt algorithms were used on 2D gray-scale synthesis and real images\nin Jordan using C# programming language. According to the comparative\nresults obtained using the three techniques, it was clearly found that Prewitt\nand Homogeneity algorithms performance were better than Sobel algorithm.\nTherefore, Prewitt and Homogeneity algorithms can be recommended\nas useful detection tools in edge detection....
Abstract: Modern supercomputers include hundreds of thousands of processors and they are thus\nmassively parallel systems. The interconnection network of a system is in charge of mutually connecting\nthese processors. Recently, the torus has become a very popular interconnection network topology.\nFor example, the Fujitsu K, IBM Blue Gene/L, IBM Blue Gene/P, and Cray Titan supercomputers all\nrely on this topology. The pairwise disjoint-path routing problem in a torus network is addressed\nin this paper. This fundamental problem consists of the selection of mutually vertex disjoint\npaths between given vertex pairs. Proposing a solution to this problem has critical implications,\nsuch as increased system dependability and more efficient data transfers, and provides concrete\nimplementation of green and sustainable computing as well as security, privacy, and trust, for instance,\nfor the Internet of Things (IoT). Then, the correctness and complexities of the proposed routing\nalgorithm are formally established. Precisely, in an n-dimensional k-ary torus.........................
Loading....